Short-length Low-density Parity-check Codes: Construction and Decoding Algorithms

Error control coding is an essential part of modern communications systems. LDPC codes have been demonstrated to offer performance near the fundamental limits of channels corrupted by random noise. Optimal maximum likelihood decoding of LDPC codes is too complex to be practically useful even at short block lengths and so a graph-based message passing decoder known as the belief propagation algorithm is used instead. In fact, on graphs without closed paths known as cycles the iterative message passing decoding is known to be optimal and may converge in a single iteration, although identifying the message update schedule which allows single-iteration convergence is not trivial. At finite block lengths graphs without cycles have poor minimum distance properties and perform poorly even under optimal decoding. LDPC codes with large block length have been demonstrated to offer performance close to that predicted for codes of infinite length, as the cycles present in the graph are quite long. In this thesis, LDPC codes of shorter length are considered as they offer advantages in terms of latency and complexity, at the cost of performance degradation from the increased number of short cycles in the graph. For these shorter LDPC codes, the problems considered are: First, improved construction of structured and unstructured LDPC code graphs of short length with a view to reducing the harmful effects of the cycles on error rate performance, based on knowledge of the decoding process. Structured code graphs are particularly interesting as they allow benefits in encoding and decoding complexity and speed. Secondly, the design and construction of LDPC codes for the block fading channel, a particularly challenging scenario from the point of view of error control code design. Both established and novel classes of codes for the channel are considered. Finally the decoding of LDPC codes by the belief propagation algorithm is considered, in particular the scheduling of messages passed in the iterative decoder. A knowledge-aided approach is developed based on message reliabilities and residuals to allow fast convergence and significant improvements in error rate performance

Structural basis for bifunctional peptide recognition at human δ-opioid receptor

Bifunctional μ- and ​δ-opioid receptor (OR) ligands are potential therapeutic alternatives, with diminished side effects, to alkaloid opiate analgesics. We solved the structure of human ​δ-OR bound to the bifunctional ​δ-OR antagonist and ​μ-OR agonist tetrapeptide ​H-Dmt-Tic-Phe-Phe-NH2 (​DIPP-NH2) by serial femtosecond crystallography, revealing a cis-peptide bond between ​H-Dmt and ​Tic. The observed receptor-peptide interactions are critical for understanding of the pharmacological profiles of opioid peptides and for development of improved analgesics